Clairvoyant state machine replication

We consider the state machine replication problem in semi-synchronous systems subject to Byzantine server failures. propose a new solution form of protocol for generalized consensus problem. The solves setting which information about conflicts between transactions is available (such can be transaction read and write sets). Unlike most prior proposals (for or classical consensus), use leader order transactions, this leaderless, relies on non-skipping timestamps ordering. Being does not need pause elections. permits servers commit as soon they know that no conflicting ordered earlier. For n f may faulty, requires > 4 .